$varepsilon$-simultaneous approximations of downward sets
نویسندگان
چکیده
in this paper, we prove some results on characterization of $varepsilon$-simultaneous approximations of downward sets in vector lattice banach spaces. also, we give some results about simultaneous approximations of normal sets.
منابع مشابه
$varepsilon$-Simultaneous approximations of downward sets
In this paper, we prove some results on characterization of $varepsilon$-simultaneous approximations of downward sets in vector lattice Banach spaces. Also, we give some results about simultaneous approximations of normal sets.
متن کامل$varepsilon$-simultaneous approximations of downward sets
in this paper, we prove some results on characterization of $varepsilon$-simultaneous approximations of downward sets in vector lattice banach spaces. also, we give some results about simultaneous approximations of normal sets.
متن کاملTest Sets of the Knapsack Problem and Simultaneous Diophantine Approximations
This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the correspon...
متن کاملStochastic Approximation on Discrete Sets Using Simultaneous Perturbation Difference Approximations
A stochastic approximation method for optimizing a class of discrete functions is considered. The procedure is a version of the Simultaneous Perturbation Stochastic Approximation (SPSA) method that has been modified to obtain a stochastic optimization method for cost functions defined on a grid of points in Euclidean p-space having integer components. We discuss the algorithm and examine its co...
متن کاملFuzzy answer sets approximations
Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These appro...
متن کاملRough Approximations on Preordered Sets
In this paper, we investigate the properties of rough approximations defined by preordered sets. We study the relations among the lower and upper rough approximations, closure and interior systems, and closure and interior operators.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
bulletin of the iranian mathematical societyناشر: iranian mathematical society (ims)
ISSN 1017-060X
دوره 39
شماره 1 2013
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023